Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under an Uncertainty Condition

Authors

  • Reza Tavakkoli-Moghaddam Professor, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
  • Siavash Tabrizian M.Sc. Grad., Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran
  • Zohreh Raziei M.Sc. Student, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Abstract:

This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second objective is to minimize the shortage of products for all retailers. In order to get closer to a real-world situation, the uncertainty in the demand of retailers is applied using fuzzy numbers. Additionally, the volume of products is applied using robust parameters, because the possible value of this parameter is not distinct and belongs to a bounded uncertainty set. The fuzzy-robust counterpart model may be larger than the deterministic form or the uncertain model with one approach and it has with further complexity; however, it provides a better efficient solution for this problem. The proposed fuzzy approach is used to solve the bi-objective mixed-integer linear problem to find the most preferred solution. Moreover, it is impossible to improve one of the objective functions without considering deterioration in the other objective functions. In order to show the conflict between two objective functions in an excellent fashion, a Pareto-optimal solution with the ε-constraint method is obtain Some numerical test problems are used to demonstrate the efficiency and validity of the presented model.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solving vehicle routing problems with asymmetric costs and heterogeneous fleets

The vehicle routing problem (VRP) is a flourishing research area with clear applications to real-life distribution companies. However, most VRP-related academic articles assume the existence of a homogeneous fleet of vehicles and/or a symmetric cost matrix. These assumptions are not always reasonable in real-life scenarios. To contribute in closing this gap between theory and practice, we propo...

full text

solving a stochastic multi-depot multi-objective vehicle routing problem by a simulated annealing

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...

full text

A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet

Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...

full text

A Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm

Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...

full text

An artificial fish swarm algorithm for solving a bi-objective capacitated vehicle routing problem

The paper focuses on a capacitated vehicle routing problem with two objectives: one is attainment of specific load factor and the other is minimization of total travel cost. Our approach is based on artificial fish swarm algorithm, a swarm-based heuristic, which mimics the foraging behaviour of a fish swarm. After initializing a school of artificial fish, whose validity is guaranteed by a desig...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 3  issue 3

pages  207- 225

publication date 2016-01-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023